A gradient system approach for Hankel structured low-rank approximation

نویسندگان

چکیده

Rank deficient Hankel matrices are at the core of several applications. However, in practice, coefficients these noisy due to e.g. measurements errors and computational errors, so generically involved full rank. This motivates problem structured low-rank approximation. Structured approximation problems, general, do not have a global efficient solution technique. In this paper we propose local optimization approach based on two-levels iteration. Experimental results show that proposed algorithm usually achieves good accuracy shows higher robustness with respect initial approximation, compared alternative approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured Low Rank Approximation

Abstract. This paper concerns the construction of a structured low rank matrix that is nearest to a given matrix. The notion of structured low rank approximation arises in various applications, ranging from signal enhancement to protein folding to computer algebra, where the empirical data collected in a matrix do not maintain either the specified structure or the desirable rank as is expected ...

متن کامل

Block-row Hankel weighted low rank approximation

This paper extends the Weighted Low Rank Approximation (WLRA) approach towards linearly structured matrices. In the case of Hankel matrices with a special block structure an equivalent unconstrained optimization problem is derived and an algorithm for solving it is proposed.

متن کامل

Nonlinearly Structured Low-Rank Approximation

Polynomially structured low-rank approximation problems occur in • algebraic curve fitting, e.g., conic section fitting, • subspace clustering (generalized principal component analysis), and • nonlinear and parameter-varying system identification. The maximum likelihood estimation principle applied to these nonlinear models leads to nonconvex optimization problems and yields inconsistent estima...

متن کامل

Software for weighted structured low-rank approximation

A software package is presented that computes locally optimal solutions to low-rank approximation problems with the following features: • mosaic Hankel structure constraint on the approximating matrix, • weighted 2-norm approximation criterion, • fixed elements in the approximating matrix, • missing elements in the data matrix, and • linear constraints on an approximating matrix’s left kernel b...

متن کامل

Global optimization for structured low rank approximation

In this paper, we investigate the complexity of the numerical construction of the Hankel structured low-rank approximation (HSLRA) problem, and develop a family of algorithms to solve this problem. Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure. Unlike many other methods described i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2021

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2020.11.016